Routing Optimization Security in Vanets using Adaptive Bees Life Algorithm for QoS-MRp and Batch Binding Update Scheme
نویسنده
چکیده
In view to provide continuous services for passengers, mobility management plays a major role in Vehicular Ad hoc Networks (VANETs). As Network Mobility (NEMO) is known for its high mobility, it becomes extremely suitable for VANETs. The vision for VANETs is road safety and aimed for efficiently dealing the mobility of a set of mobile nodes using Mobile Routers (MRs). However, inefficient routing paths, multiple tunnels and Quality of Service (QoS) requirements are major important issues of NEMO. In order to solve routing problem, proposed an novel Adaptive Bees Life Algorithm (ABLA) route optimization schema in NEMO and satisfies the QOS Multicast Routing Problem (QoS-MRP). The diversity of the space problem is estimated by using certain population characteristic values and the promising areas are exploited. Many of the traditional signatures security schemas in VANETs solve security problems for route optimization, but it leads to heavy computational costs. To overcome these issues, Batch Binding Update Scheme (BBUS) is proposed for secure accomplishment by verifying multiple signatures at the same time. The experimental results showed that the proposed algorithm is efficient in its performance in multicast traffic engineering and for evaluating the route stability in NEMO.
منابع مشابه
Multicast Routing Optimization through with Hybrid Bees Life Algorithm for Qos- MRP, Congestion and Collision Avoidance in VANETs
Article history: Received 12 March 2015 Accepted 28 June 2015 Available online 22 July 2015
متن کاملA New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملImproving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR
Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...
متن کامل